On the Galois Lattice of Bipartite Distance Hereditary Graphs
نویسندگان
چکیده
1 Istituto per le Applicazioni del Calcolo M. Picone, CNR, via dei Taurini 19, 00185 Roma, Italy, e-mail: [email protected] 2 Dipartimento di Ingegneria dell’Impresa, Università di Roma “Tor Vergata”, via del Politecnico 1, 00133 Roma, Italy, e-mail: [email protected] 3 Dipartimento di Scienze Statistiche, Sapienza Università di Roma, piazzale Aldo Moro 5, 00185 Roma, Italy, e-mail: [email protected]
منابع مشابه
On Computing the Galois Lattice of Bipartite Distance Hereditary Graphs
The class of Bipartite Distance Hereditary (BDH) graphs is the intersection between bipartite domino-free and chordal bipartite graphs. Graphs in both the latter classes have linearly many maximal bicliques, implying the existence of polynomial-time algorithms for computing the associated Galois lattice. Such a lattice can indeed be built in O(m×n) worst case-time for a domino-free graph with m...
متن کاملVertical Decomposition of a Lattice Using Clique Separators
A concept (or Galois) lattice is built on a binary relation; this relation can be represented by a bipartite graph. We explain how we can use the graph tool of clique minimal separator decomposition to decompose some bipartite graphs into subgraphs in linear time; each subgraph corresponds to a subrelation. We show that the lattices of these subrelations easily yield the lattice of the global r...
متن کاملA tight relation between series-parallel graphs and Bipartite Distance Hereditary graphs
Bandelt and Mulder’s structural characterization of Bipartite Distance Hereditary graphs asserts that such graphs can be built inductively starting from a single vertex and by repeatedly adding either pending vertices or twins (i.e., vertices with the same neighborhood as an existing one). Dirac and Duffin’s structural characterization of 2–connected series–parallel graphs asserts that such gra...
متن کاملOn factorial properties of chordal bipartite graphs
For a graph property X, let Xn be the number of graphs with vertex set {1, . . . , n} having property X, also known as the speed of X. A property X is called factorial if X is hereditary (i.e. closed under taking induced subgraphs) and n1 ≤ Xn ≤ n2 for some positive constants c1 and c2. Hereditary properties with the speed slower than factorial are surprisingly well structured. The situation wi...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 190-191 شماره
صفحات -
تاریخ انتشار 2014